The Complexity of Markov Decision Processes
نویسندگان
چکیده
منابع مشابه
The Complexity of Synchronizing Markov Decision Processes
We consider Markov decision processes (MDP) as generators of sequences of probability distributions over states. A probability distribution is psynchronizing if the probability mass is at least p in a single state, or in a given set of states. We consider four temporal synchronizing modes: a sequence of probability distributions is always p-synchronizing, eventually p-synchronizing, weakly psyn...
متن کاملComplexity Issues in Markov Decision Processes
We survey the complexity of computational problems about Markov decision processes: evaluating policies , nding good and best policies, approximating best policies, and related decision problems.
متن کاملThe Complexity of Decentralized Control of Markov Decision Processes
Planning for distributed agents with partial state information is considered from a decisiontheoretic perspective. We describe generalizations of both the MDP and POMDP models that allow for decentralized control. For even a small number of agents, the finite-horizon problems corresponding to both of our models are complete for nondeterministic exponential time. These complexity results illustr...
متن کاملThe Complexity of Planning with Partially-Observable Markov Decision Processes
This work surveys results on the complexity of planning under uncertainty. The planning model considered is the partially-observable Markov decision process. The general planning problems are, given such a process, (a) to calculate its performance under a given control policy, (b) to find an optimal or approximate optimal control policy, and (c) to decide whether a good policy exists. The compl...
متن کاملThe Complexity of Deterministically Observable Finite-Horizon Markov Decision Processes
We consider the complexity of the decision problem for diierent types of partially-observable Markov decision processes (MDPs): given an MDP, does there exist a policy with performance > 0? Lower and upper bounds on the complexity of the decision problems are shown in terms of completeness for NL, P, NP, PSPACE, EXP, NEXP or EXPSPACE, dependent on the type of the Markov decision process. For se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1987
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.12.3.441